Verification of Programs with Mutual Recursion in Pifagor Language
نویسندگان
چکیده
منابع مشابه
Verification of Mutual Recursive Functional Programs
We present an environment for proving total correctness of mutual recursive functional programs. As usual, correctness is transformed into a set of first-order predicate logic formulae—verification conditions. As a distinctive feature of our method, these formulae are not only sufficient, but also necessary for the correctness. A specialized strategy for proving termination is developed. The de...
متن کاملinterpersonal function of language in subtitling
translation as a comunicative process is always said to be associated with various aspects of meaning loss or gain. subtitling as a mode of translating, due to special discoursal and textual conditions imposed upon it, is believed to be an obvious case of this loss or gain. presenting the spoken sound track of a film in writing and synchronizing the perception of this text by the viewers with...
15 صفحه اولStructured Query Language with Recursion
Writing recursive queries for a database is currently a complicated task. The query requires the user to write complex and redundant SQL syntax. Also if the database being used as a backend is not compliant with SQL:1999 then it is not possible to write any recursive queries. In this paper, we present Structured Query Language with Recursion (SQLR), a data retrieval language used for writing re...
متن کاملSummaries for While Programs with Recursion
Procedure summaries are an approximation of the effect of a procedure call. They have been used to prove partial correctness and safety properties. In this paper, we introduce a generalized notion of procedure summaries and present a framework to verify total correctness and liveness properties of a general class of while programs with recursion. We provide a fixpoint system for computing summa...
متن کاملVerification of mutual exclusion algorithms with EST
Mutual exclusion algorithms are a simple and popular example of concurrent systems. We report about the verification of some of them with verification package EST. In the paper we propose modified models for Dekker’s and Peterson’s algorithm which give a compound system without divergent states. For Hyman’s algorithm, we explain why it does not preserve mutual exclusion.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatic Control and Computer Sciences
سال: 2018
ISSN: 0146-4116,1558-108X
DOI: 10.3103/s0146411618070301